Query Routing with Ants?

نویسندگان

  • Elke Michlmayr
  • Sabine Graf
  • Wolf Siberski
  • Wolfgang Nejdl
چکیده

In this paper we propose SemAnt, a novel ant-based algorithm designed for query routing in taxonomy-based peer-to-peer environments. We introduce the reader to the pheronome trail-laying-andfollowing behaviour observed from natural ants and show how it can be applied to query routing in peer-to-peer networks. Our proposed algorithm accounts for network parameters such as bandwidth and latency and optimizes the pheromone trails to results for a given query depending on the query’s popularity. If a query is common, its pheromone trails will converge and lead to the nodes that offer the most results for the given query. Pheromone trails that are used rarely will evaporate over time. In addition, the proposed algorithm accounts for the inherent dynamics of peer-to-peer networks by adjusting pheromone trails when peers join or leave the network.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EEQR: An Energy Efficient Query-Based Routing Protocol for Wireless Sensor Networks

Routing in Wireless Sensor Networks (WSNs) is a very challenging task due to the large number of nodes, their mobility and lack of proper infrastructure. Since the sensors are battery powered devices, energy efficiency is considered as one of the main factors in designing routing protocols in WSNs. Most of energy-aware routing protocols are mere energy savers that attempt to decrease the energy...

متن کامل

Improvement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm

Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...

متن کامل

EEQR: An Energy Efficient Query-Based Routing Protocol for Wireless Sensor Networks

Routing in Wireless Sensor Networks (WSNs) is a very challenging task due to the large number of nodes, their mobility and lack of proper infrastructure. Since the sensors are battery powered devices, energy efficiency is considered as one of the main factors in designing routing protocols in WSNs. Most of energy-aware routing protocols are mere energy savers that attempt to decrease the energy...

متن کامل

Improvement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm

Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...

متن کامل

Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005